Probabilities of hitting a convex hull

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilities of hitting a convex hull

In this note, we consider the non-negative least square method with a random matrix. This problem has connections with the probability that the origin is not in the convex hull of many random points. As related problems, suitable estimates are obtained as well on the probability that a small ball does not hit the convex hull. Abstract Dans cette Note nous appliquons la méthode des moindres carr...

متن کامل

Alpha-Concave Hull, a Generalization of Convex Hull

Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are generalizations of convex hull. Unlike the convex hull, they construct non-convex enclosure on a set of points. In this paper, we introduce another generalization of convex hull, named alpha-concave hull, and compare ...

متن کامل

Hitting probabilities and large deviations

Let ”Yn•n∈Z+ be a sequence of random variables in R d and let A ⊂ Rd: Then P”Yn ∈ A for some n• is the hitting probability of the set A by the sequence ”Yn•. We consider the asymptotic behavior, as m → ∞, of P”Yn ∈ mA; some n• = P”hitting mA• whenever (1) the probability law of Yn/n satisfies the large deviation principle and (2) the central tendency of Yn/n is directed away from the given set ...

متن کامل

Tropical Convex Hull Computations

This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial ideals, subdivisions of products of simplices, matroid theory, finite metric spaces, and the tropical Grassmannians. The relationship between these topics is expl...

متن کامل

Convex Hull Computations

The “convex hull problem” is a catch-all phrase for computing various descriptions of a polytope that is either specified as the convex hull of a finite point set in R or as the intersection of a finite number of halfspaces. We first define the various problems and discuss their mutual relationships (Section 26.1). We discuss the very special case of the irredundancy problem in Section 26.2. We...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Comptes Rendus Mathematique

سال: 2014

ISSN: 1631-073X

DOI: 10.1016/j.crma.2014.08.015